Matroid intersection, base packing and base covering for infinite matroids

نویسندگان

  • Nathan Bowler
  • Johannes Carmesin
چکیده

As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and matroid intersection and union. We show that several of these conjectures are equivalent, so that each gives a perspective on the same central problem of infinite matroid theory. For finite matroids, these equivalences give new and simpler proofs for the finite theorems corresponding to these conjectures. This new point of view also allows us to extend, and simplify the proofs of, some cases where these conjectures were known to be true.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adjacency, Inseparability, and Base Orderability in Matroids

Two elements in an oriented matroid are inseparable if they have either the same sign in every signed circuit containing them both or opposite signs in every signed circuit containing them both. Two elements of a matroid are adjacent if there is no M(K4)-minor using them both, and in which they correspond to a matching of K4. We prove that two elements e, { of an oriented matroid are inseparabl...

متن کامل

On Disjoint Common Bases in Two Matroids

We prove two results on packing common bases of two matroids. First, we show that the computational problem of common base packing reduces to the special case where one of the matroids is a partition matroid. Second, we give a counterexample to a conjecture of Chow, which proposed a sufficient condition for the existence of a common base packing. Chow’s conjecture is a generalization of Rota’s ...

متن کامل

On the intersection of infinite matroids

We show that the infinite matroid intersection conjecture of NashWilliams implies the infinite Menger theorem proved recently by Aharoni and Berger. We prove that this conjecture is true whenever one matroid is nearly finitary and the second is the dual of a nearly finitary matroid, where the nearly finitary matroids form a superclass of the finitary matroids. In particular, this proves the inf...

متن کامل

Matroids with an infinite circuit-cocircuit intersection

We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further shows that the axiom system for matroids proposed by Dress does not axiomatize all infinite matroids. We show that one of the matroids we define is a thin sums matroid whose dual isn’t a thin sums matroid.

متن کامل

5. Lecture Notes on Matroid Intersection

One nice feature about matroids is that a simple greedy algorithm allows to optimize over its independent sets or over its bases. At the same time, this shows the limitation of the use of matroids: for many combinatorial optimization problems, the greedy algorithm does not provide an optimum solution. Yet, as we will show in this chapter, the expressive power of matroids become much greater onc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorica

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2015